منابع مشابه
Expected Reachability-Time Games
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respectively, the expected time to reach a target. These games are concurrent since at each step of the game both players choose a timed move (a time delay and action under their control), and the transition of the game is ...
متن کاملComputing Laboratory EXPECTED REACHABILITY-TIME GAMES
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respectively, the expected time to reach a target. These games are concurrent since at each step of the game both players choose a timed move (a time delay and action under their control), and the transition of the game is ...
متن کاملInternship proposal Algorithms for Expected-Time Reachability
Timed automata are a simple natural model of computation for the specification of timed behaviors [1]. They are finite automata extended with clocks, i.e. real-valued variables that increase with the passage of time. Timed automata have been used in a wide range of applications where real-time aspects of computation is important, and they are supported by a variety of efficient tools and model-...
متن کاملMinimum-Time Reachability in Timed Games
We consider the minimum-time reachability problem in concurrent two-player timed automaton game structures. We show how to compute the minimum time needed by a player to reach a location against all possible choices of the opponent We do not put any syntactic restriction on the game structure, nor do we require any player to guarantee time divergence. We only require players to use physically r...
متن کاملReachability-Time Games on Timed Automata
In a reachability-time game, players Min and Max choose moves so that the time to reach a final state in a timed automaton is minimised or maximised, respectively. Asarin and Maler showed decidability of reachability-time games on strongly non-Zeno timed automata using a value iteration algorithm. This paper complements their work by providing a strategy improvement algorithm for the problem. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.04.021